Conformal Marked Bisection for Local Refinement of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e530" altimg="si306.svg"><mml:mi>n</mml:mi></mml:math>-Dimensional Unstructured Simplicial Meshes

نویسندگان

چکیده

We present an n-dimensional marked bisection method for unstructured conformal meshes. devise the local refinement in adaptive applications. To this end, we propose a mesh marking pre-process and three stages. The marks initial conformingly. Then, first n−1 bisections, accumulates reverse order list of new vertices. In second stage, n-th bisection, uses reversed to cast bisected simplices as reflected simplices, simplex type suitable newest vertex bisection. final beyond switches allow switch, after check that under uniform are reflected. These conditions sufficient use scheme guaranteeing key advantages refinement. Finally, results show proposed is well-suited

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conformal Refinement of Unstructured Quadrilateral Meshes

A multilevel adaptive refinement technique is presented for unstructured quadrilateral meshes in which the mesh is kept conformal at all times. This means that the refined mesh, like the original, is formed of only quadrilateral elements that intersect strictly along edges or at vertices, i.e., vertices of one quadrilateral element do not lie in an edge of another quadrilateral. Elements are re...

متن کامل

Local Bisection Refinement for N-Simplicial Grids Generated by Reflection

A simple local bisection refinement algorithm for the adaptive refinement of n-simplicial grids is presented. The algorithm requires that the vertices of each simplex be ordered in a special way relative to those in neighboring simplices. It is proven that certain regular simplicial grids on [0, 1]n have this property, and the more general grids to which this method is applicable are discussed....

متن کامل

Parallel Refinement of Unstructured Meshes

In this paper we describe a parallel h-refinement algorithm for unstructured finite element meshes based on the longest-edge bisection of triangles and tetrahedrons. This algorithm is implemented in PARED, a system that supports the parallel adaptive solution of PDEs. We discuss the design of such an algorithm for distributed memory machines including the problem of propagating refinement acros...

متن کامل

Geometric Properties of the Local Refinement in Unstructured Triangular Meshes

In this work we study the propagation problem due to the conformity process in the longestedge based refinement algorithms for triangular unstructured meshes. The geometric properties in study answers the important question of how the size of the triangulation is affected when local refinement is applied. We prove both theoretically and empirically that the propagation of a single triangle refi...

متن کامل

A Selective Approach to Conformal Refinement of Unstructured Hexahedral Finite Element Meshes

Hexahedral refinement increases the density of an all-hexahedral mesh in a specified region, improving numerical accuracy. Previous research using solely sheet refinement theory made the implementation computationally expensive and unable to effectively handle concave refinement regions and self-intersecting hex sheets. The Selective Approach method is a new procedure that combines two diverse ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Aided Design

سال: 2023

ISSN: ['1879-2685', '0010-4485']

DOI: https://doi.org/10.1016/j.cad.2022.103419